A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem

Metaheuristics are widely employed to solve hard optimization problems, like vehicle routing problems (VRP), for which exact solution methods impractical. In particular, local search-based metaheuristics have been successfully applied the capacitated VRP (CVRP). The CVRP aims at defining minimum-cost delivery routes a given set of identical vehicles since each only travels one route and there is single (central) depot. best avoid getting stuck in optima by embedding specific hill-climbing mechanisms such as diversification strategies into methods. This paper introduces hybridization novel adaptive version Iterated Local Search with Path-Relinking (AILS-PR) CVRP. major contribution this an automatic mechanism control diversity step metaheuristic allow it escape from optima. results experiments 100 benchmark CVPR instances show that AILS-PR outperformed state-of-the-art metaheuristics.